Generating and Processing of CDMA Signals

ABSTRACT

Systems and methods for generating a CDMA signal s(t) comprising N components involves assigning to each of the N components one unique spreading sequence a n  selected from a set of M spreading sequences with M≧N, modulating the symbols d n  of each component on the assigned unique spreading sequence a n , and combining the N symbols d n  each being spread with its own unique spreading sequence a n  to a CDMA signal s(t). The assigned spreading sequences a n  are selected such that all selected pairs within the set of N spreading sequences are orthogonal or very close to be orthogonal so that cross-correlation components between all spreading sequences a n  are close to zero or zero.

CROSS-REFERENCE TO RELATED APPLICATIONS

The present application claims priority under 35 U.S.C. §119 to European Patent Convention Application No. 12 006 039.7-2411, filed Aug. 24, 2012, the entire disclosure of which is herein expressly incorporated by reference.

TECHNICAL FIELD

Exemplary embodiments of the present invention relate to a method for generating a CDMA (Code Division Multiple Access) signal, a method for processing a CDMA signal, a CDMA signal generator, and a CDMA signal processor.

BACKGROUND

CDMA (Code Division Multiple Access) is a technology for transmission channel access, which allows a simultaneous transmission of several signals within the same band of frequencies. CDMA is used in mobile communications and satellite transmissions, for example to transmit different payload data streams in the same frequency range from satellites of a Global Navigation Satellite System (GNSS) such as NAVSTAR-GPS or the planned European GNSS called GALILEO to users. CDMA is also used for terrestrial telecommunication networks, for example in mobile communication networks of the 3^(rd) generation.

The term CDMA signal as used herein designates a code-modulated signal, i.e. a signal whose symbols are modulated with a spreading sequence or spreading code, which is transmitted from a sender such as a GNSS satellite to a receiver such as a GNSS positioning system. For example, in (NAVSTAR-) GPS to each satellite an unique C/A (coarse access) code and an unique P (precision) code are assigned as spreading codes for generating and transmitting CDMA signals. When several code-modulated signals are transmitted on the same carrier, the corresponding aggregate signal is called multiplexed or interplexed CDMA signal. Each elementary CDMA signal building the multiplexed CDMA signal is called a component.

Acquisition, tracking and data demodulation of multiplexed CDMA signals require sophisticated signal processing algorithms, which are able to extract the data contained in a received CDMA signal without a loss of information. A critical factor in CDMA systems is thermal noise, which is one of the main reasons for performance degradations. Thermal noise is usually incurred by the transmission channel and active elements of the receiver front-end.

SUMMARY OF INVENTION

Exemplary embodiments of the present invention are directed to performance improvements for acquisition, tracking or data demodulation of CDMA signals.

In accordance with exemplary embodiments of the present invention the selection of symbols used for different components of a CDMA signal is constrained in order to improve the performances for acquisition, tracking or data demodulation of that signal.

The symbols belong to components, and a CDMA signal may comprise several components. N designates the number of components. A component is comparable to a channel carrying its own information by means of the symbols of the component. At each instant and to each component of the CDMA signal one unique spreading sequence is assigned, which is used for modulating the symbols of the respective component. This sequence is different for each component, which allows discrimination or isolation of this component from the other N−1 components. According to an embodiment of the invention, over time the spreading sequence used to code the symbol of a given component can be changed, as long as it is different from the other sequences used for the modulation of the symbols of the other components, and that the receiver knows the change-schedule of the spreading sequence in order to always have access to the desired symbols. In such case, a pool of M sequences, with M≧N can be used to modulate the symbols of N components over time. Several components can transmit different information with the same CDMA signal. For example, a GNSS satellite generating and transmitting a CDMA signal according to the invention can use different components for transmitting information related to different GNSS services to GNSS receivers. A GNSS receiver can then acquire, track, and demodulate the information transmitted with the different components of the received CDMA signal by using the respective spreading sequence or code.

By introducing a constraint on the transmitted symbols, the invention provides improved performance for acquisition, tracking or data demodulation of CDMA signals, by reducing the effects of the thermal noise, which are one of the main reasons for performance degradations. In accordance with exemplary embodiments of the present invention the improved performance is achieved by using the orthogonality between the different spreading sequences and the stochastic properties of the additive thermal noise to attenuate the corresponding effects at detector (for acquisition) and discriminator (for tracking and demodulation) outputs. The signal structure and related algorithms can be adapted according to the driving performance and type of application (e.g. applications requiring a fast acquisition but low bit error rate, or requiring a large data rate with low bit error rate). For example, this invention allows creating services as e.g. indoor with the current state of the art for receiver design, without increasing the complexity and costs of these receivers. Moreover, the CDMA signal can have a constant envelop (for example, use of Multiple-Phase Shift Keying modulation, M-PSK) or not (for example use of Quadrature Amplitude Modulation, QAM).

The constraint on the transmitted symbols defines that the symbols of the components are selected to fulfill a predefined condition, for example that the product of all symbols for each time instance is a constant value over a certain period of time assuming that all modulated components have the same symbol duration. For example, if binary symbols with values +1 or −1 are used, the constraint may define that the product of all symbols for each time instance is either +1 or −1, per convention, over a certain period of time.

An embodiment of the invention relates to a method for generating a CDMA signal s(t) comprising N components, wherein the method comprises the acts of assigning to each of the N components one unique spreading sequence a_(n) selected from a set of M spreading sequences with M≧N, for example a PRN (Pseudorandom Noise) sequence, and modulating the symbols d_(n) of each component on the assigned unique spreading sequence a_(n), and combining the N symbols d_(n) each being spread with its own unique spreading sequence a_(n) to a CDMA signal s(t), wherein the assigned spreading sequences a_(n) are selected such that all selected pairs within the set of N spreading sequences are orthogonal or very close to be orthogonal so that cross-correlation components between all spreading sequences a_(n) are zero or close to zero: R_(a) _(k) _(a) _(n) (Δτ)≅0 with the expression for the cross-correlation being

${{R_{a_{k},a_{n}}({\Delta\tau})} = {\frac{1}{T_{int}}{\int_{0}^{T_{int}}{{a_{k}(t)}{a_{n}\left( {t - {\Delta\tau}} \right)}\ {t}}}}},$

and wherein the symbols d_(n) of the components are selected such that

${\left\{ {\prod\limits_{n_{1} \in E_{1}}\; {d_{n_{1}}\left( j_{1} \right)}} \right\} \cdot \left\{ {\prod\limits_{n_{2} \in E_{2}}\; {d_{n_{2}}\left( j_{2} \right)}} \right\}} = C^{st}$

and E₁∪E₂=[1, 2, . . . , k, . . . , N], wherein C^(st) is defined as a constant which, for example, can be either +1 or −1 for binary symbols, wherein E₁ contains N₁ distinct integer indexes, E₂ contains N₂ distinct integer indexes, being also distinct to the N₁ indexes with N₁+N₂=N, and wherein j₁ and j₂ correspond to two indexes for two code epochs of duration T_(int) corresponding to the symbol period T_(symbol) and wherein all modulated components have the same symbol duration, T_(symbol). For example, j₁ and j₂ can be identical (with j₁=j₂=j) to denote the same code epoch, j; or j₁ and j₂ can be different, with j₁=j and j₂=j+1, to denote two consecutive code epochs; or j₁ and j₂ can again be different, but now with j₁=j and j₂=j+Q where Q is an integer constant to denote two code epochs separated by Q code periods.

In particular, the N symbols d_(n)(j) of the components taken during the same epoch j (so that j₁=j₂=j), can be selected such that,

${\left( {\prod\limits_{n = 1}^{N}\; {d_{n}(j)}} \right) = C^{st}},$

where C^(st) designates a constant which, for example, is either +1 or −1 for binary symbols. For this specific case, it consequently means that the condition applies only to the symbols transmitted in the same code epoch.

The spreading sequences a_(n) may be maximum length sequences or Gold sequences for example (other well-known spreading sequences like Kasami or Weil sequences could also be proposed).

In an embodiment of the invention, an even number N of spreading sequences a_(n) may be provided, wherein N/(2×K) symbols d_(n)(j), taken during the same epoch j, have to be transmitted and each symbol is always modulated on (2×K) different spreading sequences such that

${\left( {\prod\limits_{n = 1}^{N}\; {d_{n}(j)}} \right) = 1},$

wherein K=1, 2, 3, . . . and K divides N/2. Thus, the same symbol is modulated on (2×K) different spreading sequences. For example, if K=1, a symbol is modulated “pair-wise” on two different spreading sequences, and if K=2, a symbol is modulated on four different spreading sequences.

In another embodiment of the invention, a number of N spreading sequences a_(n) may be provided and one of the N symbols d_(n)(j), taken during the same epoch j, may transmit a “dummy” symbol d_(q)(j) in such a way that its value is proportional to the product of the N−1 other symbols:

${\left( {\prod\limits_{n = 1}^{N}\; {d_{n}(j)}} \right) = {{\left( {\prod\limits_{\underset{n \neq q}{n = 1}}^{N}\; {d_{n}(j)}} \right){d_{q}(j)}} = {{C^{st}.{d_{q}(j)}} = {{C^{st}/\left( {\prod\limits_{\underset{n \neq q}{n = 1}}^{N}\; {d_{n}(j)}} \right)} = {C^{st}\left( {\prod\limits_{\underset{n \neq q}{n = 1}}^{N}\; {d_{n}(j)}} \right)}}}}},$

wherein C^(st) is a constant with the value +1 or −1 per convention. The last equation is possible because C^(st) is a constant with the value +1 or −1 per convention. Indeed, for binary symbols (+1/−1) the constant, C^(st) should take the value +1 or −1 too. Once this value is considered per convention, it can be used as a priori for the processing of the corresponding CDMA signal.

In another embodiment of the invention, an even number of N spreading sequences a_(n) may be provided and the product of one half of the N symbols, taken at the epoch j, with another half of the N symbols taken at the next epoch (j+1) is a constant:

${\left\{ {\prod\limits_{n_{1} \in E_{1}}\; {d_{n_{1}}(j)}} \right\} \cdot \left\{ {\prod\limits_{n_{2} \in E_{2}}\; {d_{n_{2}}\left( {j + 1} \right)}} \right\}} = C^{st}$

and E₁∪E₂=[1, 2, . . . , k, . . . , N], wherein C^(st) is defined as a constant which for example can be either +1 or −1 for binary symbols, wherein E₁ contains N₁=N/2 distinct indexes and E₂ contains N₂=N/2 distinct indexes, also being distinct from the N₁ indexes.

The method may further comprise the act of up-converting the CDMA signal s(t) from a baseband into a transmission band.

According to a further embodiment of the invention, after a certain period of time new unique spreading sequences a_(n) can be selected from the set of M spreading sequences, the newly selected unique spreading sequences a_(n) can be assigned to the N components, and the symbols d_(n) of each component can be modulated on the assigned new unique spreading sequence a_(n).

A further embodiment of the invention relates to a method for processing a CDMA signal r(t), which is generated with a method of the invention and as described above, and wherein the method for processing comprises the following steps: receiving a CDMA signal r(t) over a duration equal to J+Q spreading code periods, which corresponds to J+Q spreading code epochs, correlating the CDMA signal r(t) for the spreading code epoch of index j₁ with each of the N₁ spreading sequences and obtaining for each of the N₁ complex correlations an In-phase component A_(k,In)(J₁) and a quadrature component A_(k,Quad)(j₁), correlating the CDMA signal r(t) for the spreading code epoch of index j₂, wherein j₂=j₁+Q, with each of the N₂ spreading sequences and obtaining for each of the N₂ complex correlations an In-phase component A_(K,In)(j₂) and a quadrature component A_(k,Quad)(j₂), multiplying the N=N₁+N₂, In-phase components A_(k,In)(j₁) and A_(k,In)(j₂) for obtaining an output of the N multiplied In-phase components A_(k,In)(j₁) and A_(k,In)(j₂), multiplying the N=N₁+N₂ quadrature components A_(k,Quad)(j₁) and A_(k,Quad)(j₂) for obtaining an output of the N multiplied quadrature components A_(k,Quad)(j₁) and A_(k,Quad)(j₂), and summing the product of the N multiplied In-phase components A_(k,In)(j₁) and A_(k,In)(j₂) and the product of the N multiplied quadrature components A_(k,Quad)(j₁) and A_(k,Quad)(j₂) for obtaining a detector output D_(Π)(j₂) corresponding to the spreading code epoch j₂, repeating the preceding steps for the determination of J successive D_(Π)(j₂) detectors outputs corresponding to J successive index values of j₂, summing J successive detector outputs D_(Π)(j₂) corresponding to J successive correlations of the received signal.

If the received signal was not transmitted as baseband signal, but up-converted from a baseband to a frequency domain for transmission, the receiving of a CDMA signal r(t) may comprise down-converting the received signal to a baseband for obtaining a baseband representation of the CDMA signal r(t).

The correlating of the CDMA signal r(t) over a time period corresponding to the j^(th) spreading code epoch with each of the spreading sequences, a_(k) with index k, may be performed according to the following equations:

${A_{k,{In}}(j)} = \left\lbrack {{\left\{ {{\sqrt{P_{{Rx},k}}{d_{k}(j)}{R_{a_{k},a_{k}}({\Delta\tau})}} + {\sum\limits_{\underset{n \neq k}{n = 1}}^{N}\; {\sqrt{P_{{Rx},n}}{d_{n}(j)}{R_{a_{k},a_{n}}({\Delta\tau})}}}} \right\} \times {\cos \left( {{{\pi\Delta}\; {fT}_{int}} - {\Delta\phi}} \right)} \times \sin \; {c\left( {\Delta \; {fT}_{int}} \right)}} + {\frac{1}{T_{int}}{\int_{t_{o} + {j \cdot T_{int}}}^{t_{o} + {{({j + 1})} \cdot T_{int}}}{{{\overset{\sim}{n}}_{c}(t)} \times {a_{k}\left( {t - {\Delta\tau}} \right)}\ {t}}}}} \right\rbrack$ ${A_{k,{Quad}}(j)} = \left\lbrack {{\left\{ {{\sqrt{P_{{Rx},k}}{d_{k}(j)}{R_{a_{k},a_{k}}({\Delta\tau})}} + {\sum\limits_{\underset{n \neq k}{n = 1}}^{N}\; {\sqrt{P_{{Rx},n}}{d_{n}(j)}{R_{a_{k},a_{n}}({\Delta\tau})}}}} \right\} \times {\sin \left( {{{\pi\Delta}\; {fT}_{int}} - {\Delta\phi}} \right)} \times \sin \; {c\left( {\Delta \; {fT}_{int}} \right)}} + {\frac{1}{T_{int}}{\int_{t_{o} + {j \cdot T_{int}}}^{t_{o} + {{({j + 1})} \cdot T_{int}}}{{{\overset{\sim}{n}}_{s}(t)} \times {a_{k}\left( {t - {\Delta\tau}} \right)}\ {t}}}}} \right\rbrack$

wherein k represents the index of the desired component for which both correlations A_(k,In)(j) and A_(k,Quad)(j) are calculated, j is the index of the j^(th) period of time or epoch with a duration equal to the spreading code period or equivalently to the symbol, for which both correlations A_(k,In) and A_(k,Quad) are calculated, t is the time variable which belongs to the time interval t_(o)+j·T_(int)≦t≦t_(o)+(j+1)·T_(int) and t_(o) is an arbitrary time origin, P_(Rx,n) represents the received power of each signal component, with index n (for an M-PSK modulation all signal components have the same received power P_(Rx,N); for other types of modulations, such like QAM the elementary powers P_(Rx,n) can be different), Δτ represents the code offset between the replica and received signal, Δφ represents the phase offset between the replica and received signal, Δf represents the frequency offset—Doppler—between the replica and received signal, R_(a) _(k) _(,a) _(k) (Δτ) represents the Auto-Correlation Function between code a_(k) and code a_(k) with the expression for the auto-correlation function being

${{R_{a_{k},a_{k}}({\Delta\tau})} = {\frac{1}{T_{int}}{\int_{0}^{T_{int}}{{a_{k}(t)}{a_{k}\left( {t - {\Delta\tau}} \right)}\ {t}}}}},$

R_(a) _(k) _(,a) _(n) (Δτ) represents the Cross-Correlation Function between code a_(k) and code a_(n) with the expression for the cross-correlation function being

${{R_{a_{k},a_{n}}({\Delta\tau})} = {\frac{1}{T_{int}}{\int_{0}^{T_{int}}{{a_{k}(t)}{a_{n}\left( {t - {\Delta\tau}} \right)}\ {t}}}}},$

T_(int) is the coherent integration time equal to the symbol duration, T_(symbol), or spreading code period, ñ_(c)(t) and n _(s)(t) represent the in-phase and quadrature components of the additive noise, wherein it is supposed that the corresponding noise components are Gaussian distributed.

According to a further embodiment of the invention, a computer program may be provided, which implements a method for generating a CDMA signal s(t) according to the invention and as described before or a method for processing a CDMA signal s(t) according to the invention and as described before. The computer program may be for example installed on a computing device with a transmitter or a receiver for CDMA signals.

According to a further embodiment of the invention, a non-transitory record carrier storing a computer program according to the invention may be provided, for example a CD-ROM, a DVD, a memory card, a diskette, or a similar data carrier suitable to store the computer program for electronic access.

A further embodiment of the invention provides a CDMA signal generator for generating a CDMA signal according to the present invention comprising assigning and modulating means for assigning to each of N components one unique spreading sequence a_(n) selected from a set of M spreading sequences with M≧N and for modulating the symbols d_(n) of each component on the assigned unique spreading sequence a_(n), and combining means for combining the N symbols d_(n) each being spread with its own unique spreading sequence a_(n) to a CDMA signal s(t), wherein the assigning and modulating means are configured to select the assigned spreading sequences a_(n) such that all selected pairs within the set of N spreading sequences are orthogonal or very close to be orthogonal so that cross-correlation components between all spreading sequences a_(n) are zero or close to zero: R_(a) _(k) _(,a) _(n) (Δτ)≈0 with the expression for the cross-correlation being

${{R_{a_{k},a_{n}}({\Delta\tau})} = {\frac{1}{T_{int}}{\int_{0}^{T_{int}}{{a_{k}(t)}{a_{n}\left( {t - {\Delta\tau}} \right)}\ {t}}}}},$

and wherein the CDMA signal generator is configured to select the symbols d_(n) of the components such that

${\left\{ {\prod\limits_{n_{1} \in E_{1}}\; {d_{n_{1}}\left( j_{1} \right)}} \right\} \cdot \left\{ {\prod\limits_{n_{2} \in E_{2}}\; {d_{n_{2}}\left( j_{2} \right)}} \right\}} = C^{st}$

and E₁∪E₂=[1, 2, . . . , k, . . . , N], wherein C^(st) is defined as a constant which, for example, can be either +1 or −1 for binary symbols, wherein E₁ contains N₁ distinct integer indexes, E₂ contains N₂ distinct integer indexes, being also distinct to the N₁ indexes with N₁+N₂=N, and wherein j₁ and j₂ correspond to two indexes for two code epochs of duration T_(int) corresponding to the symbol period T_(symbol), and wherein all modulated components have the same symbol duration, T_(symbol). For example, j₁ and j₂ can be identical (with j₁=j₂=j) to denote the same code epoch, j; or j₁ and j₂ can be different, with j₁=j and j₂=j+1, to denote two consecutive code epochs; or j₁ and j₂ can again be different, but now with j₁=j and j₂=j+Q where Q is an integer constant to denote two code epochs separated by Q code periods.

Particularly, the generator may be configured to select the N symbols d_(n)(j) of the components taken during the same epoch j (so that j₁=j₂=j), can be selected such that,

${\left( {\prod\limits_{n = 1}^{N}\; {d_{n}(j)}} \right) = C^{st}},$

where C^(st) designates a constant, which for example is either +1 or −1 for binary symbols. For this specific case, it consequently means that the condition applies only to the symbols transmitted in the same code epoch.

The generator may further comprise a memory storing a computer program of the invention implementing a method for generating a CDMA signal s(t) according to the invention and a processor being configured by the stored computer program to generate a CDMA signal s(t).

A further embodiment of the invention relates to a CDMA signal processor for processing a CDMA signal generated according to the present invention and comprising a receiver for receiving a CDMA signal r(t) over a duration equal to J+Q spreading code periods, which corresponds to J+Q spreading code epochs at least one correlator for correlating the CDMA signal r(t) for the spreading code epoch of index j₁ with each of the N₁ spreading sequences and obtaining for each of the N₁ complex correlations an In-phase component A_(k,In)(j₁) and a quadrature component A_(k,Quad)(j₁) and for correlating the CDMA signal r(t) for the spreading code epoch of index j₂ with j₂=j₁+Q with each of the N₂ spreading sequences and obtaining for each of the N₂ complex correlations an In-phase component A_(k,In)(j₂) and a quadrature component A_(k,Quad)(j₂), a first multiplier for multiplying the N=N₁+N₂ In-phase components A_(k,In)(j₁) and A_(K,In)(j₂) for obtaining an output of the N multiplied In-phase components A_(k,In)(j₁) and A_(k,In)(j₂), a second multiplier for multiplying the N=N₁+N₂ quadrature components A_(k,Quad)(J₁) and A_(k,Quad)(j₂) for obtaining an output of the N multiplied quadrature components A_(k,Quad)(j₁) and A_(k,Quad)(j₂), and an adder for summing the product of the N multiplied In-phase components A_(k,Quad)(j₁) and A_(k,In)(j₂) and the product of the N multiplied quadrature components A_(k,Quad)(j₁) and A_(k,Quad)(j₂) for obtaining a detector output D_(Π)(j₂) corresponding to the spreading code epoch j₂, wherein the processor is configured to determine J successive D_(Π)(j₂) detectors outputs corresponding to J successive index values of j₂, and a second adder summing J successive detector outputs D_(Π)(j₂) corresponding to J successive correlations of the received signal.

The CDMA signal processor may further comprise a memory storing a computer program for processing a CDMA signal s(t) according to the invention and as described above and a processor being configured by the stored computer program to process a CDMA signal r(t).

Both, the CDMA signal generator and processor may be for example implemented by one or more integrated circuits, for example a chip-set or a SoC (System on Chip). The CDMA signal processor may be integrated in a mobile device such as a mobile navigation device, a smartphone, a tablet computer, or a laptop for processing CDMA signals received from for example a GNSS such as GALILEO.

These and other aspects of the invention will be apparent from and elucidated with reference to the embodiments described hereinafter.

The invention will be described in more details hereinafter with reference to exemplary embodiments. However, the invention is not limited to these exemplary embodiments.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 shows a flowchart of an algorithm implementing a method for generating a CDMA signal s(t) according to the invention;

FIG. 2 shows a flowchart of an algorithm implementing a method for processing a CDMA signal r(t) according to the invention;

FIG. 3 shows a block diagram of a CDMA signal generator according to the invention and a block diagram of a processor for processing the received CDMA signal transmitted from the generator via a transmission channel to the processor according to the invention;

FIG. 4 shows a time diagram over several epochs of N components of a CDMA signal generated according to the invention, wherein the symbols d_(n) of each component are modulated on its assigned unique spreading sequence a_(n); and

FIG. 5 shows a block diagram of a CDMA signal processor for showing the processing of a received CDMA signal generated according to the invention over several epochs. Here the particular case when the constraint

$\left( {\left( {\prod\limits_{n = 1}^{N}\; {d_{n}(j)}} \right) = C^{st}} \right)$

applies only for symbols transmitted during the same code epoch, j, is considered.

DETAILED DESCRIPTION OF EMBODIMENTS

In the following, embodiments of algorithms according to the invention, which enable to acquire, track and demodulate with high performance CDMA signals, are described. These signals are the combination of symbols spread each with PRN sequences showing good cross-correlation characteristics (the PRN sequences are orthogonal between each other, for all delays).

It will be shown that the advantages of the corresponding algorithms are all the better that the spreading codes are orthogonal.

These new algorithms will provide either a detector for acquisition or a discriminator for tracking. In both cases, the term of Π^(N) (or ‘PI’) detector will be applied to describe this detector.

First, the principle underlying the present invention is explained in detail with reference to FIGS. 1-3.

At Transmission

First, the generation of a CDMA signal on the transmission side is explained. A flowchart of an algorithm for the signal generation is shown in FIG. 1: in step S10 of the algorithm, a unique spreading sequence a_(n) is assigned to each of the components of the CDMA signal to be generated, and the N symbols d_(n) for the N components are modulated on the assigned spreading sequences a_(n). As constraint, the N symbols fulfill the condition

${\left\{ {\prod\limits_{n_{1} \in E_{1}}\; {d_{n_{1}}\left( j_{1} \right)}} \right\} \cdot \left\{ {\prod\limits_{n_{2} \in E_{2}}\; {d_{n_{2}}\left( j_{2} \right)}} \right\}} = C^{st}$

and E₁∪E₂=[1, 2, . . . , k, . . . , N]. In a special case, the condition between the N symbols taken at the same code epoch j,

$\left( {\prod\limits_{n = 1}^{N}\; {d_{n}(j)}} \right) = C^{st}$

may be applied. In a second step S12, the N symbols d_(n) are combined to a CDMA signal s(t). The following equation provides the baseband representation of the transmitted signal, which is generated by the algorithm:

${s(t)} = \left( {\sum\limits_{n = 1}^{N}\; {\sqrt{P_{{Tx},n}}{d_{n}(j)}{\sum\limits_{i = 1}^{L}\; {a_{n}\left( {t - {i\; T_{c}}} \right)}}}} \right)$

where:

-   -   N is the number of PRN sequences simultaneously transmitted,     -   j is the index of the j^(th) period of time (or epoch) with a         duration equal to the spreading code period or equivalently the         symbol, T_(symbol),     -   L is the common length for all N sequences. The chips of the         a_(n)(t) sequence have a duration T_(c),     -   d_(n)(j) is the symbol dedicated to the component or channel of         index n and to one component or channel, respectively, is         allocated a particular spreading sequence, a_(n),     -   t is the time variable which belongs to the time interval         t_(o)+j·T_(int)≦t≦t_(o)+(j+1)·T_(int) where t_(o) is an         arbitrary time origin,     -   P_(Tx,n) represents the transmitted power per channel. For an         M-PSK modulation all signal components have the same transmit         power P_(Tx,N). For other types of modulations, such like QAM         the elementary powers P_(Tx,n) can be different. The aggregate         power is consequently

$\sum\limits_{n = 1}^{N}\; {P_{{Tx},n}.}$

In a specific case the same symbol can be applied to all PRN sequences.

${s(t)} = {{d(j)}\left( {\sum\limits_{n = 1}^{N}\; {{^{j\; \phi_{n}} \cdot \sqrt{P_{{Tx},n}}}{\sum\limits_{i = 1}^{L}\; {a_{n}\left( {t - {i\; T_{c}}} \right)}}}} \right)}$

In that particular case, the aggregate power is still

$\sum\limits_{n = 1}^{N}\; P_{{Tx},n}$

At Reception

In the following, the processing of a received CDMA signal r(t) is explained. It is supposed that the received signal r(t), which directly derives from s(t) after application of the propagation effects (Free Space losses, Atmospheric effects, Multipath, . . . ) is down-converted at baseband. It should be noted that for applications which use directly signals transmitted at baseband, no down conversion is of course necessary.

The corresponding baseband representation of the signal received in step S20 (FIG. 2) can be written as (ignoring multipath effects):

${r(t)} = {\left( {\sum\limits_{n = 1}^{N}\; {{^{j\Delta\phi} \cdot \sqrt{P_{{Rx},n}}}{d_{n}(j)}{\sum\limits_{i = 1}^{L}\; {a_{n}\left( {t - {iT}_{c}} \right)}}}} \right) + {n_{th}(t)}}$

where

-   -   P_(Rx,n) represent the received power of each signal         component, n. For an M-PSK modulation all signal components have         the same received power P_(Rx,N). For other types of         modulations, such like QAM the elementary powers P_(Rx,n) can be         different.     -   n_(th)(t) represents the additional thermal noise with double         sided power spectral density N_(o)/2.

Δφ represents the residual carrier phase for the signal.

Processing

The basic principle of the new proposed class of operators according to the invention comprises first correlating the received signal with each of the spreading PRN sequences a_(n) (step S22) over a time period corresponding to the j^(th) spreading code epoch. The selection of the j^(th) spreading code epoch of the received signal and the PRN sequence a_(n) is performed according to the constraint introduced at the generation of the CDMA signal,

${\left\{ {\prod\limits_{n_{1} \in E_{1}}\; {d_{n_{1}}\left( j_{1} \right)}} \right\} \cdot \left\{ {\prod\limits_{n_{2} \in E_{2}}\; {d_{n_{2}}\left( j_{2} \right)}} \right\}} = {C^{st}.}$

It means that a part N₁ of the N correlations will be performed with the j₁ ^(th) spreading code epoch of the received signal, while another part N₂ (with N₁+N₂=N) of the N correlations will be performed with the j₂ ^(th) spreading epoch. The indexes j₁ and j₂ for the spreading code epochs are such that j₂=j₁+Q. For each correlation, the in- and quadrature components of the corresponding correlator output, evaluated for the j^(th) time (either j₁ ^(th) or j₂ ^(th)) spreading code epoch, are given by:

${A_{k,{In}}(j)} = \left\lbrack {{\begin{matrix} {\begin{Bmatrix} {{\sqrt{P_{{Rx},k}}{d_{k}(j)}{R_{a_{k},a_{k}}({\Delta\tau})}} +} \\ {\sum\limits_{\underset{n \neq k}{n = 1}}^{N}\; {\sqrt{P_{{Rx},n}}{d_{n}(j)}{R_{a_{k},a_{n}}({\Delta\tau})}}} \end{Bmatrix} \times {\cos \left( {{{\pi\Delta}\; {fT}_{int}} - {\Delta\phi}} \right)} \times} \\ {{\sin \; {c\left( {\Delta \; {fT}_{int}} \right)}} + {\frac{1}{T_{int}}{\int_{t_{o} + {j \cdot T_{int}}}^{t_{o} + {{({j + 1})} \cdot T_{int}}}{{{\overset{\sim}{n}}_{c}(t)} \times {a_{k}\left( {t - {\Delta\tau}} \right)}\ {t}}}}} \end{matrix}{A_{k,{Quad}}(j)}} = \left\lbrack \begin{matrix} {\begin{Bmatrix} {{\sqrt{P_{{Rx},k}}{d_{k}(j)}{R_{a_{k},a_{k}}({\Delta\tau})}} +} \\ {\sum\limits_{\underset{n \neq k}{n = 1}}^{N}\; {\sqrt{P_{{Rx},n}}{d_{n}(j)}{R_{a_{k},a_{n}}({\Delta\tau})}}} \end{Bmatrix} \times {\sin \left( {{{\pi\Delta}\; {fT}_{int}} - {\Delta\phi}} \right)} \times} \\ {{\sin \; {c\left( {\Delta \; {fT}_{int}} \right)}} + {\frac{1}{T_{int}}{\int_{t_{o} + {j \cdot T_{int}}}^{t_{o} + {{({j + 1})} \cdot T_{int}}}{{{\overset{\sim}{n}}_{s}(t)} \times {a_{k}\left( {t - {\Delta\tau}} \right)}\ {t}}}}} \end{matrix} \right.} \right.$

where:

-   -   k represents the index of the desired component for which both         correlations A_(k,In)(j) and A_(k,Quad)(j) are calculated,     -   j is the index of the j^(th) period of time (or epoch) with a         duration equal to the spreading code period or equivalently the         symbol, for which both correlations A_(k,In) and A_(k,Quad) are         calculated,     -   t is the time variable which belongs to the time interval         t_(o)+j·T_(int)≦t≦t_(o)+(j+1)·T_(int) and t_(o) is an arbitrary         time origin,     -   P_(Rx,n) represents the received power of each signal component,         with index n (for an M-PSK modulation all signal components have         the same received power P_(Rx,N); for other types of         modulations, such like QAM the elementary powers P_(Rx,n) can be         different),     -   Δτ represents the code offset between the replica and received         signal,     -   Δφ represents the phase offset between the replica and received         signal,     -   Δf represents the frequency offset (Doppler) between the replica         and received signal,     -   R_(a) _(k) _(,a) _(k) (Δτ) represents the Auto-Correlation         Function between code a_(k) and code a_(k).         Hereafter, the expression for the auto-correlation function is         provided,

${R_{a_{k},a_{k}}({\Delta\tau})} = {\frac{1}{T_{int}}{\int_{0}^{T_{int}}{{a_{k}(t)}{a_{k}\left( {t - {\Delta\tau}} \right)}\ {t}}}}$

-   -   R_(a) _(k) _(,a) _(n) (Δτ) represents the Cross-Correlation         Function between code a_(k) and code a_(n).         Hereafter, the expression for the cross-correlation function is         provided,

${R_{a_{k},a_{n}}({\Delta\tau})} = {\frac{1}{T_{int}}{\int_{0}^{T_{int}}{{a_{k}(t)}{a_{n}\left( {t - {\Delta\tau}} \right)}\ {t}}}}$

-   -   T_(int) is the coherent integration time equal to the symbol         duration or spreading code period,     -   ñ_(c)(t) and ñ_(s)(t) represents the in-phase and quadrature         components of the additive noise.

Here it is supposed that the corresponding variables are Gaussian distributed which is mainly the case when the filter bandwidth of the reception chain is wide enough.

By considering the specific case when the same symbol is modulating all PRN sequences:

${A_{k,{In}}(j)} = \begin{bmatrix} {{{d_{k}(j)} \cdot \begin{Bmatrix} {{\sqrt{P_{{Rx},k}}{R_{a_{k},a_{k}}({\Delta\tau})}} +} \\ {\sum\limits_{\underset{n \neq k}{n = 1}}^{N}\; {\sqrt{P_{{Rx},n}}{R_{a_{k},a_{n}}({\Delta\tau})}}} \end{Bmatrix}} \times {\cos \left( {{{\pi\Delta}\; {fT}_{int}} - {\Delta\phi}} \right)} \times} \\ {{\sin \; {c\left( {\Delta \; {fT}_{int}} \right)}} + {\frac{1}{T_{int}}{\int_{t_{o} + {j \cdot T_{int}}}^{t_{o} + {{({j + 1})} \cdot T_{int}}}{{{\overset{\sim}{n}}_{c}(t)} \times {a_{k}\left( {t - {\Delta\tau}} \right)}\ {t}}}}} \end{bmatrix}$ ${A_{k,{Quad}}(j)} = \begin{bmatrix} {{{d_{k}(j)} \cdot \begin{Bmatrix} {{\sqrt{P_{{Rx},k}}{R_{a_{k},a_{k}}({\Delta\tau})}} +} \\ {\sum\limits_{\underset{n \neq k}{n = 1}}^{N}\; {\sqrt{P_{{Rx},n}}{R_{a_{k},a_{n}}({\Delta\tau})}}} \end{Bmatrix}} \times {\sin \left( {{{\pi\Delta}\; {fT}_{int}} - {\Delta\phi}} \right)} \times} \\ {{\sin \; {c\left( {\Delta \; {fT}_{int}} \right)}} + {\frac{1}{T_{int}}{\int_{t_{o} + {j \cdot T_{int}}}^{t_{o} + {{({j + 1})} \cdot T_{int}}}{{{\overset{\sim}{n}}_{s}(t)} \times {a_{k}\left( {t - {\Delta\tau}} \right)}\ {t}}}}} \end{bmatrix}$

The second step in the generation of the D_(Π)(j₂) detector evaluated for the j₂ ^(th) spreading code epoch consists in multiplying the N In-Phase correlator outputs together (steps S24, S26), and to sum the corresponding product with the product of the N Quadrature Phase correlator outputs (step S28). Here the general case when the constraint regarding the symbol values applies for symbols belonging to two different code epochs j₁ and j₂ with j₂=j₁+Q is considered.

${D_{\Pi}\left( j_{2} \right)} = {{\left\{ {\prod\limits_{k_{1} \in E_{1}}^{N}\; {A_{k_{1},{In}}\left( j_{1} \right)}} \right\} \cdot \left\{ {\prod\limits_{k_{2} \in E_{2}}^{N}\; {A_{k_{2},{In}}\left( j_{2} \right)}} \right\}} + {\left\{ {\prod\limits_{k_{1} \in E_{1}}^{N}\; {A_{k_{1},{Quad}}\left( j_{1} \right)}} \right\} \cdot \left\{ {\prod\limits_{k_{2} \in E_{2}}^{N}\; {A_{k_{2},{Quad}}\left( j_{2} \right)}} \right\}}}$

Where the combination of the ensembles E₁ and E₂ of indexes contains all integer indexes from 1 to N: E₁∪E₂=[1, 2, . . . , k, . . . , N]. The detector output is thus the combination of correlator outputs corresponding to the code epochs j₁ and j₂. Since both code epochs j₁ and j₂ are such that j₂=j₁+Q, it is possible express the detector output only with index j₂ and therefore D_(Π)(j₂).

In particular, when the constraint applicable to the symbol applies only for symbols transmitted during the same code epoch, j (with j=j₁=j₂), the sum of the product of the N-In Phase correlators with the N-Quad correlators is formed.

${D_{\Pi}(j)} = {{\prod\limits_{k = 1}^{N}\; {A_{k,{In}}(j)}} + {\prod\limits_{k = 1}^{N}\; {A_{k,{Quad}}(j)}}}$

The last step in the generation of the D_(Π) detector consists in adding J successive D_(Π)(j₂) detector outputs, each computed with the code epochs j₁ and j₂ such that j₂=j₁+Q, and j₂ varies from Q to J+Q as shown on the step (S30).

$D_{\Pi} = {\sum\limits_{j_{2} = 1}^{J}\; {D_{\Pi}\left( j_{2} \right)}}$

FIG. 3 shows a block diagram of a CDMA signal generator 10 and a block diagram of a CDMA signal processor 20 for processing the signal generated by the generator 10 and transmitted via a transmission channel 18 to the processor.

In the generator 10, assigning and modulating means 16 assign to each of the N components or channels 14 an unique spreading PRN sequence a_(n) with length L, and modulate the symbols d_(n) of each channel on the assigned unique spreading sequence a_(n). A condition

${\left\{ {\prod\limits_{n_{1} \in E_{1}}\; {d_{n_{1}}\left( j_{1} \right)}} \right\} \cdot \left\{ {\prod\limits_{n_{2} \in E_{2}}\; {d_{n_{2}}\left( j_{2} \right)}} \right\}} = C^{st}$

and E₁∪E₂=[1, 2, . . . , k, . . . , N] (reference numeral 13) between the N symbols transmitted at each time instant by the CDMA signal is introduced. Means 16 combine the N symbols d_(n) to a CDMA signal s(t) according to the shown formula. The CDMA signal s(t) is then transmitted via a transmission channel 18, which adds thermal noise n_(th)(t) to the signal s(t) whose power is reduced by the losses for propagation between emitter and transmitter, to the processor 20. A receiver 22 of the processor 20 receives the CDMA signal r(t)=s(t)+n_(th)(t). Correlators 24 and 26 correlate the CDMA signal r(t) with each of the spreading sequences and the correlator 24 obtains for each of the N correlations an In-phase component A_(k,In)(j₁) or A_(k,In)(j₂) according to the selected component k, and the correlator 26 obtains for each of the N correlations a quadrature component A_(k,Quad)(j₁) or A_(k,Quad)(j₂) according to the selected component k, which are forwarded to multipliers 28. A first multiplier (in block 28) multiplies the N In-phase components A_(k,In)(j₁) and A_(k,in)(j₂) for obtaining a correlator output of the N In-phase components A_(k,In)(j₁) and A_(k,in)(j₂) and a second multiplier (in block 28) multiplies the N quadrature components A_(k,Quad)(j₁) and A_(k,Quad)(j₂), for obtaining a correlator output of the N quadrature components A_(k,Quad)(j₁) and A_(k,Quad)(j₂). An adder (also in block 28) adds the multiplied correlator outputs of the N In-phase components A_(k,In)(j₁) and A_(k,in)(j₂) and the multiplied correlator outputs of the N quadrature components A_(k,Quad)(j₁) and A_(k,Quad)(j₂) for obtaining a detector output D_(Π)(j₂). Finally J consecutive and elementary detector outputs for J consecutive spreading code epochs of the received signal, are summed (block 30).

FIG. 4 shows a time diagram over J epochs of N components of a CDMA signal generated according to the invention. The symbols d₁ to d_(N) of the N components are modulated on their assigned unique spreading sequences a₁ to a_(N), respectively. Each epoch 1 to J has a duration T_(int) corresponding to the symbol period T_(symbol). The spreading sequences a₁ to a_(N) are selected such that they are orthogonal or at least close to be orthogonal so that the cross-correlation components between the N spreading sequences a_(n) are zero or close to zero.

FIG. 5 shows a block diagram of a CDMA signal processor for showing the processing of a received CDMA signal generated according to the invention over several epochs j=1 to J. In this example the following constraint

$\left( {\overset{N}{\prod\limits_{n = 1}}\; {d_{n}(j)}} \right) = C^{st}$

between the symbols d_(n)(j) taken at the same code epoch, j, has been applied at the signal generation. A similar block diagram can be proposed for the more general constraint,

${\left\{ {\prod\limits_{n_{1} \in E_{1}}\; {d_{n_{1}}\left( j_{1} \right)}} \right\} \cdot \left\{ {\prod\limits_{n_{2} \in E_{2}}\; {d_{n_{2}}\left( j_{2} \right)}} \right\}} = {C^{st}.}$

The processor receives signal r(t) over several epochs with an Analog and a Digital Front-End, which outputs the Quadrature component r_(Quad)(t) and the In phase-component r_(In)(t) for further processing. The components r_(Quad)(t) and r_(In)(t) are correlated for the epochs j=1 to J with the spreading sequences corresponding to the epochs. Then the N In-Phase (resp. Quadrature) correlator outputs are multiplied for each epoch j. The products for the In-phase and Quadrature components are formed and then added for each epoch j. Finally J consecutive and elementary detector outputs for J consecutive spreading code epochs of the received signal form the final detector output.

In order to show the advantage of the corresponding Π^(N) operator with other more conventional operators using, for example, a matched filter approach, the deterministic contribution (the signal of interest) and the stochastic contribution (due to the thermal noise) are analyzed in the following separately.

In the following it is proposed, for purposes of illustration, to assume that all components receive the same power: P_(Rx,n)=P_(Rx,N), ∀n (M-PSK scenario for example). A similar approach can be applied for other types of modulation, such like QAM.

Furthermore, the particular case when the constraint

$\left( {\left( {\overset{N}{\prod\limits_{n = 1}}\; {d_{n}(j)}} \right) = C^{st}} \right)$

between the symbols applies only for symbols transmitted during the same code epoch, j, is considered in this illustration.

Finally, it is proposed to consider first the evaluation of the detector output for a single spreading code epoch (J=1). Later, the advantage of cumulating J successive detector outputs will be explained (J>1).

Focus on the Deterministic Components (Noise Contribution Removed)

It can then be shown that:

${D_{\Pi}(j)} = {\begin{bmatrix} {\prod\limits_{k = 1}^{N}\; {\sqrt{P_{{Rx},N}}\left\{ {{{d_{k}(j)}{R_{a_{k},a_{k}}({\Delta\tau})}} + {\sum\limits_{\underset{n \neq k}{n = 1}}^{N}\; {{d_{n}(j)}{R_{a_{k},a_{n}}({\Delta\tau})}}}} \right\} \times}} \\ {\cos \left( {{{\pi\Delta}\; {fT}_{int}} - {\Delta\phi}} \right) \times \sin \; {c\left( {\Delta \; {fT}_{int}} \right)}} \end{bmatrix} + {\prod\limits_{k = 1}^{N}\; \begin{bmatrix} {\sqrt{P_{{Rx},N}}{d(j)}\left\{ {{{d_{k}(j)}{R_{a_{k},a_{k}}({\Delta\tau})}} + {\sum\limits_{\underset{n \neq k}{n = 1}}^{N}\; {{d_{n}(j)}{R_{a_{k},a_{n}}({\Delta\tau})}}}} \right\} \times} \\ {{\sin \left( {{{\pi\Delta}\; {fT}_{int}} - {\Delta\phi}} \right)} \times \sin \; {c\left( {\Delta \; {fT}_{int}} \right)}} \end{bmatrix}}}$

It is considered, as an illustrative case, that during the acquisition process, the hypothesis (in the Code-Doppler grid) is such that the replica and the received signals are aligned (Δτ=0). This case corresponds to the main peak of correlation when the losses due to any code mis-alignment are zero.

Furthermore, it is supposed that the cross-correlation components between all spreading sequences {a_(i)} are zero: R_(a) _(k) _(,a) _(n) (Δτ)≅0. To achieve this objective, a proper code design will have to ensure that all selected pairs (within the set of N applied spreading sequences) are orthogonal or very close to be orthogonal. As an example, the preferred pairs of a set of m (maximum length)-sequences show such required very advantageous correlation properties.

Of course, the N Auto-Correlation functions become R_(a) _(k) _(,a) _(k) (Δτ=0)=1.

In that case it yields.

${D_{\Pi}(j)} = {{P_{N}^{N/2}\left( {\prod\limits_{n = 1}^{N}{d_{n}(j)}} \right)}\left\{ {{\cos^{N}\left( {{{\pi\Delta}\; f\; T_{int}} - {\Delta \; \phi}} \right)} + {\sin^{N}\left( {{\pi \; \Delta \; f\; T_{int}} - {\Delta \; \phi}} \right)}} \right\} \times \sin \; {c^{N}\left( {\Delta \; f\; T_{int}} \right)}}$

Hence, it appears that the detector output is proportional to P_(N) ^(N/2).

It must be noted that if the N symbols d_(n)(j) are independent, the detector output can be either +P_(N) ^(N/2) or −P_(N) ^(N/2) (when Δf=Δφ=0), while if some constraint exists between the corresponding symbols

${{d_{n}(t)}\left( {\left( {\prod\limits_{n = 1}^{N}{d_{n}(j)}} \right) = C^{st}} \right)},$

it is possible to always “force” the corresponding detector output to have the same sign. Forcing the sign of the detector output and consequently providing an “a priori” for the decision could improve the acquisition performance, and for example the reduction of the Probability of False Alarm in GNSS applications. For example, if the output of the detector is known a priori to be positive, all negative detector outputs can be rejected and consequently a gain of factor around 2 is achieved in the probability of False Alarm (a similar reasoning applies if the detector is known a priori to be negative: in that case all positive detector outputs could be discarded).

Here two possible solutions to “force” the detector output to have a specific sign are proposed:

Constraint 1):

If the same symbol is always modulated on two (resp. or 2×K) different spreading sequences, there are (N/2) (resp N/(2×K)) products of 1: then:

$\left( {\prod\limits_{n = 1}^{N}{d_{n}(j)}} \right) = 1.$

This supposes of course that N is even and that N/2 is dividable by K.

Constraint 2):

Another condition could consist in having N spreading sequences, and one of the channels transmits a “dummy” symbol, d_(q)(j), in such a way that:

$\left( {\prod\limits_{n = 1}^{N}{d_{n}(j)}} \right) = {{\left( {\prod\limits_{\underset{n \neq q}{n = 1}}^{N}{d_{n}(j)}} \right){d_{q}(j)}} = {{C^{st}.{d_{q}(j)}} = {{C^{st}/\left( {\prod\limits_{\underset{n \neq q}{n = 1}}^{N}{d_{n}(j)}} \right)} = {C^{st} \cdot {\left( {\prod\limits_{\underset{n \neq q}{n = 1}}^{N}{d_{n}(j)}} \right).}}}}}$

Because the symbols are binary (+1/−1) the constant, C^(st), appearing in the previous equations should take the value +1 or −1. Then it is fixed per convention (to guarantee the a priori).

The advantage with respect to the “Constraint 1” is that instead of having reduced with one half (resp. 1/(2×K)) the number of different symbols transmitted (and consequently the effective symbol rate), only one symbol over N is not used for data transmission (this leads to a smaller reduction of the effective symbol rate). Indeed, this symbol does not provide any useful information, since it is the product of all other symbols. In a certain sense it can be considered as sacrificed. The second advantage is that here N can be either Even or Odd.

These two solutions for the “forcing” of the detector output sign show the trade-off that exists between symbol rate (larger for the second constraint), and the Bit Error Rate (better for the first constraint since more energy would be available for the same symbol at demodulation).

By considering the specific case when the same symbol is modulating all PRN sequences, the detector output becomes:

D _(Π)(j)=P _(N) ^(N/2) d ^(N)(j){cos^(N)(πΔfT _(int)−Δφ)+sin^(N)(πΔfT _(int)−Δφ)}×sinc^(N)(Δft _(int))

If N is even, the detector output will automatically always be positive, and again it is possible to reject all negative detector outputs. This is achieved at the price of an N times lower symbol rate, but of course and N times larger energy per bit available.

Focus on the Stochastic Components

In fact the main advantage of the corresponding Π^(N) operator resides in the large reduction of the stochastic contribution due to either the orthogonality between the in-phase (n_(c)(t)) or quadrature-phase (n_(s)(0) noise components, or the orthogonality between spreading sequences either for a zero code offset (R_(a) _(k) _(a) _(j) (Δτ=0)=0 or ≈0) or a non-zero code offset (R_(a) _(k) _(,a) _(j) (Δτ≠0)=0 or ≅0).

The basic principle can be illustrated when considering the product of the two following integrals involving the correlation between the noise and the spreading codes:

$\frac{1}{T_{int}}{\int_{0}^{T_{int}}{{{\overset{\sim}{n}}_{c/s}(u)} \times {a_{n}\left( {u - {\Delta \; \tau}} \right)}{u}\mspace{14mu} {and}\mspace{14mu} \frac{1}{T_{int}}{\int_{0}^{T_{int}}{{{\overset{\sim}{n}}_{c/s}(u)} \times {a_{k}\left( {u - {\Delta \; \tau}} \right)}{u}}}}}$

where the noise components ñ_(c/s)(u) can be either the in-phase (ñ_(c)(u)) or quadrature phase (ñ_(s)(u)) components of the thermal noise, and the spreading sequence a_(n) might or not be different to the spreading sequence a_(k).

These two integrals correspond to the stochastic contributions that would be multiplied when considering an elementary multiplication between two correlator outputs. Since ñ_(c)(u) and ñ_(s)(u) are Gaussian their multiplication with a binary sequence a_(n)(u) or a_(k)(u) is still Gaussian, and the sum (integral) of the corresponding a_(k)(u)×ñ_(c)(u) is also Gaussian.

Hereafter the different combinations for the noise ñ_(c)(u)/ñ_(s)(u) and the spreading sequences a_(n)(u)/a_(k)(u) are considered:

Case 1:

Same noise contribution ñ_(c)(u) or ñ_(s)(u) in both integrals but two different spreading sequences a_(n)(u) and a_(k)(u). Here the case of ñ_(c)(u) for both integrals is considered for illustration.

${E\left\{ {\int_{o}^{T_{int}}{\int_{o}^{T_{int}}{{{\overset{\sim}{n}}_{c}(u)}{a_{k}\left( {u - {\Delta \; \tau}} \right)}{{\overset{\sim}{n}}_{c}(v)}{a_{n}\left( {v - {\Delta\tau}} \right)}{u}{v}}}} \right\}} = {{\int_{o}^{T_{int}}{\int_{o}^{T_{int}}{{a_{k}\left( {v - \tau} \right)}{a_{n}\left( {u - \tau} \right)}E\left\{ {{{\overset{\sim}{n}}_{c}(v)}{{\overset{\sim}{n}}_{c}(u)}} \right\} {v}{u}}}} = {{\int_{o}^{T_{int}}{\int_{o}^{T_{int}}{{a_{k}\left( {v - {\Delta \; \tau}} \right)}{a_{n}\left( {u - {\Delta\tau}} \right)}\frac{N_{o}}{2}{\delta \left( {t - u} \right)}{v}{u}}}} = {{\frac{N_{o}}{2}{\int_{o}^{T_{int}}{\int_{o}^{T_{int}}{{a_{k}\left( {v - {\Delta \; \tau}} \right)}{a_{n}\left( {u - {\Delta\tau}} \right)}{\delta \left( {v - u} \right)}{v}{u}}}}} = {{\frac{N_{o}}{2}{\int_{o}^{T_{int}}{{a_{k}\left( {v - {\Delta\tau}} \right)}{a_{n}\left( {v - {\Delta \; \tau}} \right)}{v}}}} = {\frac{N_{o}}{2}{{R_{a_{k},a_{n}}(0)} \cdot T_{int}}}}}}}$

If both spreading sequences a_(n)(u) and a_(k)(u) are perfectly orthogonal, R_(a) _(k) _(,a) _(n) (0)=0, the expectation of the product of the two previous integrals is zero.

Case 2:

Different noise contributions ñ_(c)(u) or ñ_(s)(u) in both integrals and same spreading sequences a_(k)(u) equal to a_(n)(u).

${E\left\{ {\int_{o}^{T_{int}}{\int_{o}^{T_{int}}{{{\overset{\sim}{n}}_{c}(u)}{a_{n}\left( {u - {\Delta \; \tau}} \right)}{{\overset{\sim}{n}}_{s}(v)}{a_{n}\left( {v - {\Delta\tau}} \right)}{u}{v}}}} \right\}} = {{\int_{o}^{T_{int}}{\int_{o}^{T_{int}}{{a_{n}\left( {v - \tau} \right)}{a_{n}\left( {u - \tau} \right)}E\left\{ {{{\overset{\sim}{n}}_{c}(v)}{{\overset{\sim}{n}}_{s}(u)}} \right\} {v}{u}}}} = 0}$

Indeed, per definition the two in-phase and quadrature noise components are independent.

Case 3:

Different noise contributions ñ_(c)(u) or ñ_(s)(u) in both integrals and two different spreading sequences a_(n)(u) and a_(k)(u). This case is simply the combinations of both previous cases, and consequently the expectation of the product of the two previous integrals is zero.

Case 4:

Same noise contributions ñ_(c)(u) or ñ_(s)(u) in both integrals and same spreading sequences a_(k)(u) equal to a_(n)(u).

$\left. {{E\left\{ {\int_{o}^{T_{int}}{\int_{o}^{T_{int}}{{{\overset{\sim}{n}}_{c}(u)}{a_{n}\left( {u - {\Delta \; \tau}} \right)}{{\overset{\sim}{n}}_{c}(v)}{a_{n}\left( {v - {\Delta\tau}} \right)}{u}{v}}}} \right\}} = {{\int_{o}^{T_{int}}{\int_{o}^{T_{int}}{{a_{n}\left( {v - \tau} \right)}{a_{n}\left( {u - \tau} \right)}E\left\{ {{{\overset{\sim}{n}}_{c}(v)}{{\overset{\sim}{n}}_{c}(u)}} \right\} {v}{u}}}} = {{\int_{o}^{T_{int}}{\int_{o}^{T_{int}}{{a_{n}\left( {v - {\Delta \; \tau}} \right)}{a_{n}\left( {u - {\Delta\tau}} \right)}\frac{N_{o}}{2}{\delta \left( {v - u} \right)}{v}{u}}}} = {\frac{N_{o}}{2}{\int_{o}^{T_{int}}{\int_{o}^{T_{int}}{{a_{n}\left( {v - {\Delta \; \tau}} \right)}{a_{n}\left( {u - {\Delta\tau}} \right)}{\delta \left( {v - u} \right)}{v}{u}}}}}}}} \right\} = {{\frac{N_{o}}{2}{\int_{o}^{T_{int}}{{a_{n}\left( {v - {\Delta\tau}} \right)}{a_{n}\left( {v - {\Delta \; \tau}} \right)}{t}}}} = {{\frac{N_{o}}{2}{{R_{a_{n},a_{n}}(0)} \cdot T_{int}}} = {\frac{N_{o}}{2} \cdot T_{int}}}}$

Indeed the auto-correlation of the sequence a_(n)(t), R_(a) _(n) _(,a) _(n) (0) is 1.

Hence, it can be verified that over four cases of integral multiplications, 3 of them are zero due to either the code a_(n)(u) and a_(k)(u), or the noise ñ_(c)(u) and ñ_(s)(u) orthogonality.

In the previous example, the product of only two integrals was considered. When considering the Π^(N) detector, N such integrals will be multiplied. Then two main situations apply:

-   -   If N is odd the expectation of a product of N Gaussian variables         is zero.     -   If N is even a mathematical theorem shows that

$\begin{matrix} {{E\left\{ {\prod\limits_{j = 1}^{2n}X_{J}} \right\}} = {{\sum\limits_{A \in A}{\prod\limits_{{\{{i,j}\}} \in A}{\rho_{ij}\mspace{14mu} {and}\mspace{14mu} \rho_{ij}}}} = {E\left\{ {X_{i}X_{j}} \right\}}}} & \left( {{eq}\mspace{14mu} 1} \right) \end{matrix}$

where

-   -   X_(i) represents a Gaussian variable equal to

${\frac{1}{T_{int}}{\int_{0}^{T_{int}}{{{\overset{\sim}{n}}_{c/s}(u)} \times {a_{i}\left( {u - {\Delta \; \tau}} \right)}{u}}}},$

and S is the collection of all N S={X_(i)}_(iε[1:N]).

-   -   A represents a collection of pair-wise disjoint and non-empty         subsets of S whose union is S.     -   Let A be a partition of {1, 2, . . . , 2N}. A is called a pair         partition if each set AεA has exactly two elements. In order to         illustrate the previous theorem the case where N=4 can be shown:

E{X ₁ X ₂ X ₃ X ₄}=ρ₁₂·ρ₃₄+ρ₁₃·ρ₂₄+ρ₁₄·ρ₂₃  (eq 2)

Equations (eq 1) and (eq 2) show in that way that the expectation of the product of N Gaussian variables can be decomposed in a sum of products for the elementary expectations involving pairs of Gaussian variables. Since it was previously shown that due to the code orthogonality and noise independence properties the corresponding products were most of the time zero it is expected that the corresponding expectation and consequently the stochastic contribution to the Π^(N) detectors rapidly vanish when N is large.

In order to compare the advantage of the proposed invention it is also proposed to compare the corresponding performance with more conventional detectors based on matched filters. These performances will be measured with the SNR ratio of the detector, D, defined as:

${SNR}_{D} = \frac{\left\lbrack {E\left\{ D \right\}} \right\rbrack^{2}}{{var}\left\{ D \right\}}$

Two cases of matched filters will be considered:

The first case applies when the same symbol d(j) is transmitted on all N channels. One conventional operator would consist in correlating the received signal with the sum of the N replicas (equivalent to summing the correlator outputs) and to add the squares of the corresponding in- and quadrature summed correlator outputs. The corresponding detector is called D_(Σ) _(c) (sub-script c, standing for coherent).

${D_{\Sigma_{c}}(j)} = {\left( {\sum\limits_{k = 1}^{N}{A_{k,\ln}(j)}} \right)^{2} + \left( {\sum\limits_{k = 1}^{N}{A_{k,{Quad}}(j)}} \right)^{2}}$

Here again the deterministic part of the corresponding detector is evaluated. For this it is supposed that the cross-correlations R_(a) _(k) _(,a) _(n) (0) are equal to zero for kin. In that case it appears that the deterministic part of D_(Σ) _(c) is (ignoring again the noise contribution):

${D_{\Sigma_{c}}(j)} = {\left\{ {{(j)\left\lbrack {\sqrt{P_{N}}{\sum\limits_{k = 1}^{N}{\left\{ {R_{a_{k},a_{k}}(0)} \right\} \times {\cos \left( {{{\pi\Delta}\; f\; T_{int}} - {\Delta \; \phi}} \right)} \times \sin \; {c\left( {\Delta \; f\; T_{int}} \right)}}}} \right\rbrack}} \right\}^{2} + \left\{ {{(j)\left\lbrack {\sqrt{P_{N}}{\sum\limits_{k = 1}^{N}{\left\{ {R_{a_{k},a_{k}}(0)} \right\} \times {\sin \left( {{\pi \; \Delta \; f\; T_{int}} - {\Delta \; \phi}} \right)} \times \sin \; {c\left( {\Delta \; f\; T_{int}} \right)}}}} \right\rbrack}} \right\}^{2}}$ ${D_{\Sigma_{c}}(j)} = {\left\lbrack {\sqrt{P_{N}}N\; \sin \; {c\left( {\Delta \; f\; T_{int}} \right)}} \right\rbrack^{2} \cdot {\quad{\left\lbrack {{\cos^{2}\left( {{\pi \; \Delta \; f\; T_{int}} - {\Delta \; \phi}} \right)} + {\sin^{2}\left( {{\pi \; \Delta \; f\; T_{int}} - {\Delta \; \phi}} \right)}} \right\rbrack = {P_{N}N^{2}\sin \; {c^{2}\left( {\Delta \; f\; T_{int}} \right)}}}}}$

When comparing the analytical expressions for the D_(Π) _(c) and D_(Σ) _(c) detectors some differences can be highlighted: First the effect of the Doppler mismatch, Δf, will degrade less the D_(Σ) _(c) output value than the D_(Π) _(c) detector one, since the sinc function, with the Doppler mismatch Δf as argument, is squared for the conventional detector, while it is at power of N for the D_(Π) _(c) detector. Therefore it sounds that the conventional matched D_(Σ) _(c) detector is more efficient that the new proposed one, D_(Π) _(c) . However, for applications where the corresponding Doppler mismatch is not that high the corresponding effects for Doppler mismatch are limited. This is the case of terrestrial applications with terrestrial transmitters (beacons, base transmit station), like for in-door applications.

For P_(N)<1, N²P_(N) (applicable for D_(Σ) _(c) ) is larger than P_(N) ^(N/2) (applicable for D_(Π) _(c) ) and the output of the D_(Σ) _(c) becomes larger than this of the D_(Π) _(c) one. Now for P>1 the D_(Π) _(c) output will exceed the D_(Σ) _(c) one for some values of N that depend on P. So the situation is inverse and therefore no general advantage w.r.t. to the term N²P_(N) (applicable for D_(Σ) _(c) ) or P_(N) ^(N/2) (applicable for D_(Π) _(c) ) can be stated (pros and cons depend on the P and N configurations).

Additionally, it can be shown with simulations that the stochastic contribution is more reduced in the D_(Π) _(c) detector than in the D_(Σ) _(c) due to the aforementioned properties for code orthogonality and noise independence. This is especially true when N is odd. This reduction of the stochastic term for the D_(Σ) _(c) with respect to the D_(Σ) _(c) will also compensate the differences in the deterministic term previously highlighted.

Finally, the D_(Σ) _(c) detector applies when the same symbol is modulated on all N components of the CDMA signal, while for the D_(Π) _(c) , N different symbols can be modulated. Even if one symbol has to be sacrificed (when considering the second option used to guarantee a constant value of the detector output), the overall data throughput for the signal applicable for the D_(Π) _(c) detector will be larger than this used for the D_(Σ) _(c) detector, especially when N is large (example of QAM-16 with N=16 different components).

The second possible detector used for comparison applies when N different symbols d_(n)(t) are transmitted on the N channels. Here it is not possible to add the corresponding correlator outputs directly. It is necessary to first square them in order to suppress the effect of the symbol flips. The corresponding detector is called D_(Σ) _(nc) nc, standing for non-coherent).

${D_{\Sigma_{NC}}(j)} = {{\sum\limits_{k = 1}^{N}\left( {A_{k,\ln}(j)} \right)^{2}} + {\sum\limits_{k = 1}^{N}\left( {A_{k,{Quad}}(j)} \right)^{2}}}$

Here again the deterministic part of the corresponding detector is evaluated. The same hypotheses as for the D_(Σ) _(c) detector are applied here:

${D_{\Sigma_{nc}}(j)} = {{\sum\limits_{k = 1}^{N}\left\{ {{(j)}\sqrt{P_{N}}{R_{a_{k},a_{k}}(0)} \times {\cos \left( {{\pi \; \Delta \; f\; T_{int}} - {\Delta \; \phi}} \right)} \times \sin \; {c\left( {\Delta \; f\; T_{int}} \right)}} \right\}^{2}} + {\sum\limits_{k = 1}^{N}\left\{ {{(j)}\sqrt{P_{N}}{R_{a_{k},a_{k}}(0)} \times {\sin \left( {{\pi \; \Delta \; f\; T_{int}} - {\Delta \; \phi}} \right)} \times \sin \; {c\left( {\Delta \; f\; T_{int}} \right)}} \right\}^{2}}}$ ${D_{\Sigma_{nc}}(j)} = {\left( \sqrt{P_{N}} \right)^{2}{\quad\left\lbrack {{\sum\limits_{k = 1}^{N}{\left\{ {{\cos\left( {{\pi \; \Delta \; f\; T_{int}} - {\Delta \; \phi}} \right\}}^{2} + {\sum\limits_{k = 1}^{N}\left\{ {\sin \left( {{{\pi\Delta}\; f\; T_{int}} - {\Delta \; \phi}} \right)} \right\}^{2}}} \right\rbrack \times \sin \; {c^{2}\left( {\Delta \; f\; T_{int}} \right)}{D_{\Sigma_{nc}}(j)}}} = {P_{N} \times N \times \sin \; {c^{2}\left( {\Delta \; f\; T_{int}} \right)}}} \right.}}$

When compared to the D_(Σ) _(c) detector output it appears that the D_(Σ) _(nc) output is N times smaller, but of course the symbol rate is N times larger. When comparing the D_(Σ) _(nc) output with the D_(Π) _(c) one, similar statements as those presented to the D_(Σ) _(c) output can be proposed.

The Doppler mismatch dependency might degrade more the D_(Π) _(c) detector output than the D_(Σ) _(nc) one but again for applications with low Doppler (terrestrial one, Indoor, etc. . . . ) this difference should not be significant.

For P_(N)<1, N P_(N) (applicable for D_(Σ) _(nc) ) is larger than P_(N) ^(N/2) (applicable for D_(Π) _(c) ) and the output of the D_(Σ) _(nc) becomes larger than this of the D_(Π) _(c) one. Now for P>1 the D_(Π) _(c) output will exceed the D_(Σ) _(nc) for some values of N that depend on P (those values are smaller than in the D_(Σ) _(c) case). Again, no general advantage w.r.t. to the term N P_(N) (applicable for D_(Σ) _(nc) ) or P_(N) ^(N/2) (applicable for D_(Π) _(c) ) can be stated.

As for the D_(Σ) _(c) it can be shown with simulations that the stochastic contribution is more reduced in the D_(Π) _(c) detector than in the D_(Σ) _(nc) to the aforementioned properties of code orthogonality and noise independence.

Now, the D_(Σ) _(nc) has a bit rate larger than this of the D_(Π) _(c) detector since for the D_(Σ) _(nc) is not necessary to sacrifice one data symbol over N. Of course for large number of components (like a QAM-16 with N=16 components) this difference becomes minimal.

As a conclusion the detection performances of the D_(Π) _(c) have to be compared with those of the D_(Σ) _(c) and D_(Σ) _(nc) when considering not only the absolute value of deterministic part of the detector output but also the effective data (symbol) rate and also the contribution from the stochastic part which vanishes more for the D_(Π) _(c) due to the properties of code orthogonality and noise independence.

The former qualitative, semi-quantitative assessments were derived for a Π^(N) detector evaluated over single code epoch (J=1). Now a second significant benefit of the Π detector is that it is possible to cumulate successive detector outputs over many epochs since the symbol sign changes have been suppressed thanks to the condition between the symbols (their product has always the same value). Therefore it is possible to integrate for many symbol periods, even many seconds, without a problem of symbol-bit edges, or even small frequency errors.

The former assessments were proposed when the condition

$\left( {\prod\limits_{n = 1}^{N}\; {d_{n}(j)}} \right) = 1$

applies to symbols corresponding to the same spreading code epoch, j. Similar assessments could be derived when considering the situation when the constraint,

${{\left\{ {\prod\limits_{n_{1} \in \; E_{1}}^{\;}\; {d_{n_{1}}\left( j_{1} \right)}} \right\} \cdot \left\{ {\prod\limits_{n_{2} \in \; E_{2}}^{\;}\; {d_{n_{2}}\left( j_{2} \right)}} \right\}} = C^{st}},$

applies between symbols at two different spreading code epochs, j₁ and j₂. This type of detector applying this alternate condition enables to determine the phase variations between epoch j₁ and j₂. This detector could consequently be used as discriminator for the Phase Lock Loops or Frequency Lock Loops.

The foregoing disclosure has been set forth merely to illustrate the invention and is not intended to be limiting. Since modifications of the disclosed embodiments incorporating the spirit and substance of the invention may occur to persons skilled in the art, the invention should be construed to include everything within the scope of the appended claims and equivalents thereof. 

What is claimed is:
 1. A method for generating a CDMA signal s(t) comprising N components, the method comprises the acts of: assigning to each of the N components one unique spreading sequence a_(n) selected from a set of M spreading sequences with M≧N and modulating symbols d_(n) of each component on the assigned unique spreading sequence a_(n); and combining the N symbols d_(n) each being spread with its own unique spreading sequence a_(n) to form a CDMA signal s(t), wherein the assigned spreading sequences a_(n) are selected such that all selected pairs within the set of N spreading sequences are orthogonal or very close to be orthogonal so that cross-correlation components between all spreading sequences a_(n) are close to zero or zero: R_(a) _(k) _(,a) _(n) (Δτ)≅0 with the expression for the cross-correlation being ${{R_{a_{k},a_{n}}({\Delta\tau})} = {\frac{1}{T_{int}}{\int_{0}^{T_{int}}{{a_{k}(t)}{a_{n}\left( {t - {\Delta\tau}} \right)}\ {t}}}}},$ and wherein the symbols d_(n) of the components are selected such that ${\left\{ {\prod\limits_{n_{1} \in \; E_{1}}^{\;}\; {d_{n_{1}}\left( j_{1} \right)}} \right\} \cdot \left\{ {\prod\limits_{n_{2} \in \; E_{2}}^{\;}\; {d_{n_{2}}\left( j_{2} \right)}} \right\}} = C^{st}$ and E₁∪E₂=[1, 2, . . . , k, . . . , N], wherein C^(st) is defined as a constant, wherein E₁ contains N₁ distinct integer indexes, E₂ contains N₂ distinct integer indexes, being also distinct to the N₁ indexes with N₁+N₂N, and wherein j₁ and j₂ correspond to two indexes for two code epochs of duration T_(int) corresponding to the symbol period T_(symbol), and wherein all modulated components have the same symbol duration.
 2. The method of claim 1, wherein j₁=j₂=j and the N symbols d_(n)(j) of the components are selected such that the condition becomes $\left( {\prod\limits_{n = 1}^{N}\; {d_{n}(j)}} \right) = C^{st}$ where C^(st) designates a constant which is either +1 or −1 for binary symbols.
 3. The method of claim 1, wherein an even number N of spreading sequences a_(n) is provided, wherein N/(2×K) symbols d_(n)(j) have to be transmitted and each symbol is always modulated on (2×K) different spreading sequences such that ${\left( {\prod\limits_{n = 1}^{N}\; {d_{n}(j)}} \right) = 1},$ wherein K=1, 2, 3, . . . and K divides N/2.
 4. The method of claim 1, wherein a number N of spreading sequences a_(n) is provided and one of the N symbols d_(n)(j), taken during the same epoch j, transmits a dummy symbol d_(q)(j) in such a way that its value is proportional to the product of the N−1 other symbols: ${\left( {\prod\limits_{n = 1}^{N}\; {d_{n}(j)}} \right) = {{\left( {\prod\limits_{\underset{n \neq q}{n = 1}}^{N}\; {d_{n}(j)}} \right){d_{q}(t)}} = {{C^{st}.{d_{q}(j)}} = {{C^{st}\text{/}\left( {\prod\limits_{\underset{n \neq q}{n = 1}}^{N}\; {d_{n}(j)}} \right)} = {C^{st} \cdot \left( {\prod\limits_{\underset{n \neq q}{n = 1}}^{N}\; {d_{n}(j)}} \right)}}}}},$ wherein C^(st) is a constant with the value +1 or −1.
 5. The method of claim 1, wherein an even number of N spreading sequences a_(n) is provided and the product of one half of the N symbols, taken at the epoch j, with another half of the N symbols taken at the next epoch (j+1) is a constant: ${\left\{ {\prod\limits_{n_{1} \in \; E_{1}}^{\;}\; {d_{n_{1}}(j)}} \right\} \cdot \left\{ {\prod\limits_{n_{2} \in \; E_{2}}^{\;}\; {d_{n_{2}}\left( {j + 1} \right)}} \right\}} = C^{st}$ and E₁∪E₂=[1, 2, . . . , k, . . . , N], wherein C^(st) is defined as a constant, wherein E₁ contains N₁=N/2 distinct indexes and E₂ contains N₂=N/2 distinct indexes, also being distinct from the N₁ indexes.
 6. The method of claim 1, further comprising the act of: up-converting the CDMA signal s(t) from a baseband into a transmission band.
 7. The method of claim 1, wherein after a certain period of time new unique spreading sequences a_(n) are selected from the set of M spreading sequences, the newly selected unique spreading sequences a_(n) are assigned to the N components, and the symbols d_(n) of each component are modulated on the assigned new unique spreading sequence a_(n).
 8. A method for processing a CDMA signal r(t), the method for processing comprises the following steps: receiving a CDMA signal r(t) over a duration equal to J+Q spreading code periods, which corresponds to J+Q spreading code epochs; correlating the CDMA signal r(t) for the spreading code epoch of index j₁ with each of N₁ spreading sequences and obtaining for each of the N₁ complex correlations an In-phase component A_(k,In)(j₁) and a quadrature component A_(k,Quad)(j₁); correlating the CDMA signal r(t) for the spreading code epoch of index j₂, wherein j₂=j₁+Q, with each of N₂ spreading sequences and obtaining for each of the N₂ complex correlations an In-phase component A_(k,In)(j₂) and a quadrature component A_(k,Quad)(j₂); multiplying the N=N₁+N₂ In-phase components A_(k,In)(j₁) and A_(k,In)(j₂) to obtain an output of the N In-phase components A_(k,In)(j₁) and A_(k,In)(j₂); multiplying the N=N₁+N₂ quadrature components A_(k,Quad)(j₁) and A_(k,Quad)(j₂) to obtain an output of the N quadrature components A_(k,Quad)(j₁) and A_(k,Quad)(j₂); summing the product of the N multiplied In-phase components A_(k,In)(j₁) and A_(k,In)(j₂) and the product of the N multiplied quadrature components A_(k,Quad)(j₁) and A_(k,Quad)(j₂) for obtaining a detector output D_(Π)(j₂) corresponding to the spreading code epoch j₂; and repeating the preceding steps for the determination of J successive D_(Π)(j₂) detectors outputs corresponding to J successive index values of j₂, summing J successive detector outputs D_(Π)(j₂) corresponding to J successive correlations of the received signal.
 9. The method of claim 8, wherein the receiving of a CDMA signal r(t) comprises down-converting the received signal to a baseband for obtaining a baseband representation of the CDMA signal r(t).
 10. The method of claim 8, wherein the correlation of the CDMA signal r(t) over a time period corresponding to the j^(th) spreading code epoch with each of the spreading sequences, a_(k) with index k, is performed according to the following equations: ${A_{k,{In}}(j)} = \begin{bmatrix} {{\left\{ {{\sqrt{P_{{Rx},k}}{d_{k}(j)}{R_{a_{k},a_{k}}({\Delta\tau})}} + {\sum\limits_{\underset{n \neq k}{n = 1}}^{N}\; {\sqrt{P_{{Rx},n}}{d_{n}(j)}{R_{a_{k},a_{n}}({\Delta\tau})}}}} \right\} \times {\cos \left( {{{\pi\Delta}\; {fT}_{int}} - {\Delta\phi}} \right)} \times \sin \; {c\left( {\Delta \; {fT}_{int}} \right)}} +} \\ {\frac{1}{T_{int}}{\int_{t_{0} + {j \cdot T_{int}}}^{t_{0} + {{({j + 1})} \cdot T_{int}}}{{{\overset{\sim}{n}}_{c}(t)} \times {a_{k}\left( {t - {\Delta\tau}} \right)}\ {t}}}} \end{bmatrix}$ ${A_{k,{Quad}}( j)} = \left\lbrack \begin{matrix} {{\left\{ {{\sqrt{P_{{Rx},k}}{d_{k}(j)}{R_{a_{k},a_{k}}({\Delta\tau})}} + {\sum\limits_{\underset{n \neq k}{n = 1}}^{N}\; {\sqrt{P_{{Rx},n}}{d_{n}(j)}{R_{a_{k},a_{n}}({\Delta\tau})}}}} \right\} \times {\sin \left( {{{\pi\Delta}\; {fT}_{int}} - {\Delta\phi}} \right)} \times \sin \; {c\left( {\Delta \; {fT}_{int}} \right)}} +} \\ {\frac{1}{T_{int}}{\int_{t_{o} + {j \cdot T_{int}}}^{t_{o} + {{({j + 1})} \cdot T_{int}}}{{n_{s}(t)} \times {a_{k}\left( {t - {\Delta\tau}} \right)}\ {t}}}} \end{matrix} \right\rbrack$ wherein k represents the index of the desired component for which both correlations A_(k,In)(j) and A_(k,Quad)(j) are calculated, j is the index of the j^(th) period of time or epoch with a duration equal to the spreading code period or equivalently the symbol, for which both correlations A_(k,In) and A_(k,Quad) are calculated, t is the time variable which belongs to the time interval t_(o)+j·T_(int)≦t≦t_(o)+(j+1)·T_(int) and t_(o) is an arbitrary time origin, P_(Rx,n) represent the received power of each signal component of index n, Δτ represents the code offset between the replica and received signal, Δφ represents the phase offset between the replica and received signal, Δf represents the frequency offset—Doppler—between the replica and received signal, R_(a) _(k) _(,a) _(k) (Δτ) represents the Auto-Correlation Function between code a_(k) and code a_(k) with the expression for the auto-correlation function being ${{R_{a_{k},a_{k}}({\Delta\tau})} = {\frac{1}{T_{int}}{\int_{0}^{T_{int}}{{a_{k}(t)}{a_{k}\left( {t - {\Delta\tau}} \right)}\ {t}}}}},$ R_(a) _(k) _(,a) _(n) (Δτ) represents the Cross-Correlation Function between code a_(k) and code a_(n) with the expression for the cross-correlation function being ${{R_{a_{k},a_{n}}({\Delta\tau})} = {\frac{1}{T_{int}}{\int_{0}^{T_{int}}{{a_{k}(t)}{a_{n}\left( {t - {\Delta\tau}} \right)}\ {t}}}}},$ T_(int) is the coherent integration time equal to the symbol duration, T_(symbol), or spreading code period, ñ_(c)(t) and ñ_(s)(t) represents the in-phase and quadrature components of the additive noise, wherein it is assumed that the corresponding noise components are Gaussian distributed.
 11. A computer program for generating a CDMA signal s(t) comprising N components, the computer program being stored on a non-transitory computer-readable medium, the computer program, when executed by a processor, causes the processor to: assign to each of the N components one unique spreading sequence a_(n) selected from a set of M spreading sequences with M≧N; modulate symbols d_(n) of each component on the assigned unique spreading sequence a_(n); and combine the N symbols d_(n) each being spread with its own unique spreading sequence a_(n) to a CDMA signal s(t), wherein the assigned spreading sequences a_(n) are selected such that all selected pairs within the set of N spreading sequences are orthogonal or very close to be orthogonal so that cross-correlation components between all spreading sequences a_(n) are close to zero or zero: R_(a) _(k) _(,a) _(n) (Δτ)≅0 with the expression for the cross-correlation being ${{R_{a_{k},a_{n}}({\Delta\tau})} = {\frac{1}{T_{int}}{\int_{0}^{T_{int}}{{a_{k}(t)}{a_{n}\left( {t - {\Delta\tau}} \right)}\ {t}}}}},$ and wherein the symbols d_(n) of the components are selected such that ${\left\{ {\prod\limits_{n_{1} \in \; E_{1}}^{\;}\; {d_{n_{1}}\left( j_{1} \right)}} \right\} \cdot \left\{ {\prod\limits_{n_{2} \in \; E_{2}}^{\;}\; {d_{n_{2}}\left( j_{2} \right)}} \right\}} = C^{st}$ and E₁∪E₂=[1, 2, . . . , k, . . . , N], wherein C^(st) is defined as a constant, wherein E₁ contains N₁ distinct integer indexes, E₂ contains N₂ distinct integer indexes, being also distinct to the N₁ indexes with N₁+N₂=N, and wherein j₁ and j₂ correspond to two indexes for two code epochs of duration T_(int) corresponding to the symbol period T_(symbol), and wherein all modulated components have the same symbol duration.
 12. A CDMA signal generator comprising: assigning and modulating means for assigning to each of N components an unique spreading sequence a_(n) selected from a set of M spreading sequences with M≧N and for modulating the symbols d_(n) of each component on the assigned unique spreading sequence a_(n); and a combiner configured to combine the N symbols d_(n) each being spread with its own unique spreading sequence a_(n) to a CDMA signal s(t), wherein the assigning and modulating means are configured to select the assigned spreading sequences a_(n) such that all selected pairs within the set of N spreading sequences are orthogonal or very close to be orthogonal so that cross-correlation components between all spreading sequences a_(n) are zero or close to zero: R_(a) _(k) _(,a) _(n) (Δτ)≅0 with the expression for the cross-correlation being, ${{R_{a_{k},a_{n}}({\Delta\tau})} = {\frac{1}{T_{int}}{\int_{0}^{T_{int}}{{a_{k}(t)}{a_{n}\left( {t - {\Delta\tau}} \right)}\ {t}}}}},$ and wherein the CDMA signal generator is configured to select the symbols d_(n) of the components such that ${\left\{ {\prod\limits_{n_{1} \in \; E_{1}}^{\;}\; {d_{n_{1}}\left( j_{1} \right)}} \right\} \cdot \left\{ {\prod\limits_{n_{2} \in \; E_{2}}^{\;}\; {d_{n_{2}}\left( j_{2} \right)}} \right\}} = C^{st}$ and E₁∪E₂=[1, 2, . . . , k, . . . , N], wherein C^(st) is defined as a constant, wherein E₁ contains N₁ distinct integer indexes, E₂ contains N₂ distinct integer indexes, also being distinct to the N₁ indexes with N₁+N₂=N, and wherein j₁ and j₂ correspond to two indexes for two code epochs of duration T_(int) corresponding to the symbol period T_(symbol), and wherein all modulated components have the same symbol duration
 13. The generator of claim 12, wherein the assigning and modulating means are part of an integrated circuit.
 14. A CDMA signal processor comprising a receiver configured to receive a CDMA signal r(t) over a duration equal to J+Q spreading code periods, which corresponds to J+Q spreading code epochs; at least one correlator configured to correlate the CDMA signal r(t) for the spreading code epoch of index j₁ with each of the N₁ spreading sequences and obtaining for each of the N₁ complex correlations an In-phase component A_(k,In)(j₁) and a quadrature component A_(k,Quad)(j₁) and for correlating the CDMA signal r(t) for the spreading code epoch of index j₂ with j₂=j₁+Q with each of the N₂ spreading sequences and obtaining for each of the N₂ complex correlations an In-phase component A_(k,In)(j₂) and a quadrature component A_(k,Quad)(j₂); a first multiplier configured to multiply the N=N₁+N₂ In-phase components A_(k,In)(j₁) and A_(k,In)(j₂) for obtaining an output of the N multiplied In-phase components A_(k,In)(j₁) and A_(k,In)(j₂); a second multiplier configured to multiply the N=N₁+N₂ quadrature components A_(k,Quad)(j₁) and A_(k,Quad)(j₂) for obtaining an output of the N multiplied quadrature components A_(k,Quad)(j₁) and A_(k,Quad)(j₂); and an adder configured to sum a product of the N multiplied In-phase components A_(k,In)(j₁) and A_(k,In)(j₂) and a product of the N multiplied quadrature components A_(k,Quad)(j₁) and A_(k,Quad)(j₂) for obtaining a detector output D_(Π)(j₂) corresponding to the spreading code epoch j₂, wherein the processor is configured to determine J successive D_(Π)(j₂) detectors outputs corresponding to J successive index values of j₂, and a second adder configured to sum J successive detector outputs D_(Π)(j₂) corresponding to J successive correlations of the received signal. 